Biased Metropolis-Heatbath Algorithms for Lattice Gauge Theory
نویسندگان
چکیده
It is illustrated for 4D SU(2) lattice gauge theory that sampling with a biased Metropolis scheme is essentially equivalent to using the heatbath algorithm. Only, the biased Metropolis method can also be applied when an efficient heatbath algorithm does not exist. Other cases for which the use of the biased Metropolis-heatbath algorithm is beneficial are briefly summarized.
منابع مشابه
Application of Biased Metropolis Algorithms: From protons to proteins
We show that sampling with a biased Metropolis scheme is essentially equivalent to using the heatbath algorithm. However, the biased Metropolis method can also be applied when an efficient heatbath algorithm does not exist. This is first illustrated with an example from high energy physics (lattice gauge theory simulations). We then illustrate the Rugged Metropolis method, which is based on a s...
متن کاملGenetic Algorithm for SU(2) Gauge Theory on a 2-dimensional Lattice
A hybrid algorithm is proposed for pure SU(N) lattice gauge theory based on Genetic Algorithms (GA)s and the Metropolis method. We apply the hybrid GA to pure SU(2) gauge theory on a 2-dimensional lattice and find the action per plaquette and Wilson loops being consistent with those given by the Metropolis and Heatbath methods. The thermalization of this newly proposed Hybrid GA is quite faster...
متن کاملGenetic Algorithm for SU(N) gauge theory on a lattice
An algorithm is proposed for the simulation of pure SU(N) lattice gauge theories based on Genetic Algorithms(GAs). Main difference between GAs and Metropolis methods(MPs) is that GAs treat a population of points at once, while MPs treat only one point in the searching space. This provides GAs with information about the assortment as well as the fitness of the evolution function and producing a ...
متن کاملHeat Bath Efficiency with Metropolis-type Updating
We illustrate for 4D SU(2) and U(1) lattice gauge theory that sampling with a biased Metropolis scheme is essentially equivalent to using the heat bath algorithm. Only, the biased Metropolis method can also be applied when an efficient heat bath algorithm does not exist. For the examples discussed the biased Metropolis algorithm is also better suited for parallelization than the heat bath algor...
متن کاملProgram package for multicanonical simulations of U(1) lattice gauge theory
We document our Fortran 77 code for multicanonical simulations of 4D U(1) lattice gauge theory in the neighborhood of its phase transition. This includes programs and routines for canonical simulations using biased Metropolis heatbath updating and overrelaxation, determination of multicanonical weights via a Wang-Landau recursion, and multicanonical simulations with fixed weights supplemented b...
متن کامل